Set-shifting as a component process of goal-directed problem-solving
نویسندگان
چکیده
منابع مشابه
Set-shifting as a component process of goal-directed problem-solving.
In two experiments, we compared secondary task interference on Tower of London performance resulting from three different secondary tasks. The secondary tasks were designed to tap three different executive functions, namely set-shifting, memory monitoring and updating, and response inhibition. Previous work using individual differences methodology suggests that, all other things being equal, th...
متن کاملGoal-Directed Equation Solving
Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like E&LOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms....
متن کاملSymposium on Problem Solving and Goal-Directed Sequential Activity
Background and Motivation Problem solving is one of the hallmarks of human cognition. The term covers a wide range of behaviors, including abilities for solving unfamiliar puzzles, designing new artifacts, generating extended plans, and pursuing complex routine activities. These each require people to carry out sequences of mental or physical steps to achieve their objectives. They can involve ...
متن کاملGalliwasp: A Goal-Directed Answer Set Solver
Galliwasp is a goal-directed implementation of answer set programming. Unlike other answer set solvers, Galliwasp computes partial answer sets which are provably extensible to full answer sets. Galliwasp can execute arbitrary answer set programs in a top-down manner similar to SLD resolution. Galliwasp generates candidate answer sets by executing ordinary rules in a top-down, goal-directed mann...
متن کاملGoal Solving as Operational Semantics
To combine a functional or equational programming style with logic programming, one can use an underlying logic of Horn clauses with equality (as an interpreted predicate symbol) and (typed) terms. From this point of view, the most satisfying operational semantics would search for solutions to equations or predicates. \Narrowing" and many of its variants are complete mechanisms for generating s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Psychological Research
سال: 2015
ISSN: 0340-0727,1430-2772
DOI: 10.1007/s00426-015-0652-2